int QueueLen(SqQueue Q){
	int n;
	n=(Q->rear-Q->front+MAXQSIZE)%MAXQSIZE;
	return n;
}
int EnQueue(SqQueue &Q, Person e){
	if((Q->rear+1)%MAXQSIZE==Q->front)
	return OVERFLOW;
	Q->rear=(Q->rear+1)%MAXQSIZE;
	Q->data[Q->rear]=e;
	return OK;
}
int QueueEmpty(SqQueue &Q){
	if(Q->front==Q->rear)
	return OK;
	else 
	return ERROR;
}
int DeQueue(SqQueue &Q, Person &e){
	if(Q->front==Q->rear)
	return ERROR;
	Q->front=(Q->front+1)%MAXQSIZE;
	e=Q->data[Q->front];
	return OK;
}
void DancePartner(Person dancer[], int num){
	int i;
	Person fe,me;
	for(i=0;i<num;i++){
		if(dancer[i].sex=='F')
		EnQueue(Fdancers,dancer[i]);
		else
		EnQueue(Mdancers,dancer[i]);
	}
	while(!QueueEmpty(Fdancers) && !QueueEmpty(Mdancers)){
		DeQueue(Fdancers,fe); DeQueue(Mdancers,me);
		cout<<fe.name<<"  "<<me.name<<endl;
	}	
}
